Solution to the bank simulation problem (Assignment 4 from 2002)

Solution de la simulation d'une banque (devoir 4 de 2002)

Note: The solution was originally conceived in french.

Overview (see english README) / Résumé (voir README file)

• Here is another translation from the README file:

• This program simulates the waiting and service times of clients that wait in a bank. A number C of Tellers serve a number F of waiting queues.
• The queues have different priorities. Within each queue, clients are served in FIFO order.
• A random service time is assigned to each client and an arbitrary preparation time is determined for each teller (time to prepare for the next client).
• The current simulation programs assumes that there are 2 queues (individual clients and company clients). Each teller checks how many queues are actually present and selects a client from the queues in the order of their priority.

Modeling: The following documents are provided:

• architecture.png : a simple class-relationship diagram
• survol.png : intuitive description of entities and their responsibilities
• sequenceService.png : a typical (simplied) sequence of actions related to inviting the next client to be served

Java program

• en français (zip file)
• in English (zip file)